Probe Ptolemaic Graphs
نویسندگان
چکیده
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, such that G can be embedded into a graph of G by adding edges between certain nonprobes. In this paper we study the probe graphs of ptolemaic graphs when the partition of vertices is unknown. We present some characterizations of probe ptolemaic graphs and show that there exists a polynomial-time recognition algorithm for probe ptolemaic graphs.
منابع مشابه
Laminar Structure of Ptolemaic Graphs and Its Applications
Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs, and it is a natural generalization of block graphs (and hence trees). In this paper, a new characterization of ptolemaic graphs is presented. It is a laminar structure of cliques, and leads us to a canonical tr...
متن کاملOn the Laminar Structure of Ptolemaic and Distance Hereditary Graphs
Ptolemaic graphs are graphs that satisfy ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs. The graph class can also be seen as a natural generalization of block graphs (and hence trees). In this paper, a new characterization of ptolemaic graphs is presented. It is a canonical tree representation based on...
متن کاملNew results on ptolemaic graphs
In this paper, we analyze ptolemaic graphs for its properties as chordal graphs. Firstly, two characterizations of ptolemaic graphs are proved. The first one is based on the reduced clique graph, a structure that was defined by Habib and Stacho [8]. In the second one, we simplify the characterization presented by Uehara and Uno [13] with a new proof. Then, known subclasses of ptolemaic graphs a...
متن کاملLongest Path Problems on Ptolemaic Graphs
SUMMARY Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there are few known graph classes such that the longest path problem can be solved efficiently. Polynomial time algorithms for finding a longest cycle and a longest path in a Ptolemaic graph are pr...
متن کاملLaminar structure of ptolemaic graphs with applications
Ptolemaic graphs are those satisfying the Ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs. It can also be seen as a natural generalization of block graphs (and hence trees). In this paper, we first state a laminar structure of cliques, which leads to its canonical tree representation. This result is a t...
متن کامل